1850F - We Were Both Children - CodeForces Solution


brute force implementation math number theory

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
int   main(){
 int  t;
 cin>>t;
 while(t--){
    int n;
    cin>>n;
    map<int,int> m,ans;
    for(int i=0;i<n;i++){
        int a;
        cin>>a;
        m[a]++;
    }
    for(auto it : m){
      int a=it.first;
      int cnt=it.second;
      while(a<=n){
        ans[a]+=cnt;
        a+=it.first;
      }
    }
    int an=0;
    for(auto it:ans){
        an=max(an,it.second);
    }
    cout<<an<<endl;
}}


Comments

Submit
0 Comments
More Questions

1455B - Jumps
1225C - p-binary
1525D - Armchairs
1257A - Two Rival Students
1415A - Prison Break
1271A - Suits
259B - Little Elephant and Magic Square
1389A - LCM Problem
778A - String Game
1382A - Common Subsequence
1512D - Corrupted Array
667B - Coat of Anticubism
284B - Cows and Poker Game
1666D - Deletive Editing
1433D - Districts Connection
2B - The least round way
1324A - Yet Another Tetris Problem
246B - Increase and Decrease
22E - Scheme
1566A - Median Maximization
1278A - Shuffle Hashing
1666F - Fancy Stack
1354A - Alarm Clock
1543B - Customising the Track
1337A - Ichihime and Triangle
1366A - Shovels and Swords
919A - Supermarket
630C - Lucky Numbers
1208B - Uniqueness
1384A - Common Prefixes